The saturated prefilter monad

نویسندگان

چکیده

This paper considers some extensions of the notion filter to quantale-valued context, including saturated prefilter, ?-filter and bounded prefilter. The question is whether these constructions give rise monads on category sets. It shown that answer depends structure quantale. Specifically, if quantale unit interval equipped with a continuous t-norm, then only implication operator corresponding t-norm at each point off diagonal.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Isbell monad

Article history: Received 30 October 2014 Accepted 6 January 2015 Available online xxxx Communicated by Ross Street MSC: 18A32 18B15

متن کامل

The Constructive Lift Monad

The lift monad is the construction which to a poset freely adjoins a bottom element to it, or equivalently (from the classical viewpoint), the construction which freely adjoins suprema for subsets with at most one element. In constructive mathematics (i.e. inside a topos), these two constructions are no longer equivalent, since the equivalence is based on the boolean reasoning that a set with a...

متن کامل

The Monad . Reader

The barbarians are at the gates. Hordes of Java programmers are being exposed to generics and delegates; hundreds of packages have been uploaded to Hackage; the Haskell IRC channel has nearly hit 500 users; and it's only a matter of time before Microsoft seals that multi-billion dollar bid for Hayoo. The time has come to retreat and climb higher into our ivory tower: we need to design a languag...

متن کامل

The Quantum IO Monad

We present an interface from Haskell to quantum programming: the Quantum IO monad, and use it to implement Shor’s factorisation algorithm. The QIO monad separates reversible (i.e. unitary) and irreversible (i.e. probabilistic) computations and provides a reversible let operation (ulet), allowing us to use ancillas (auxiliary qubits) in a modular fashion. Exploiting Haskell’s class system we can...

متن کامل

The proof monad

A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to describe the computational features of proof languages, such as side effects, exception handling, and backtracking. The formalism, called proof monads, finds its roots in category theory, and in particular satisfies t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2021

ISSN: ['1879-3207', '0166-8641']

DOI: https://doi.org/10.1016/j.topol.2020.107525